Persistence of Termination for Right-Linear Overlay Term Rewriting Systems
نویسنده
چکیده
A property is called persistent if for any manysorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that termination is persistent for right-linear overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that termination is modular for right-linear overlay term rewriting systems.
منابع مشابه
Persistence of Termination for Locally Confluent Overlay Term Rewriting Systems
A property is called persistent if for any manysorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that termination is persistent for locally confluent overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that co...
متن کاملTermination of Rewriting with Right-Flat Rules Modulo Permutative Theories
We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand side terms are restricted to be shallow (variables occur at depth at most one) and linear (each variable occurs at most once). Innermost termin...
متن کاملDecidable/Undecidable Properties of Conditional Term Rewriting Systems
Decidability/undecidability of properties in subclasses of conditional term rewriting systems (CTRSs, for short) of natural, join, and oriented types are studied. The properties focused are convertibility, reachability, joinability, con uence, and termination. In particular, it is shown that (1) all of the properties listed above are undecidable for left-linear right-ground CTRSs of each types ...
متن کاملUndecidable Properties on Length-Two String Rewriting Systems
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that confluence, termination, left-most termination and right-most termination are undecidable properties for length-two string rewriting systems. This results mean that these properties are undecidable for the class of linear term rewriting systems in which dept...
متن کاملPersistence of Termination for Term Rewriting Systems with Ordered Sorts
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema’s result can be extended to term rewriting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005